Cartesian effect categories are Freyd-categories
نویسندگان
چکیده
منابع مشابه
Cartesian effect categories are Freyd-categories
Most often, in a categorical semantics for a programming language, the substitution of terms is expressed by composition and finite products. However this does not deal with the order of evaluation of arguments, which may have major consequences when there are side-effects. In this paper Cartesian effect categories are introduced for solving this issue, and they are compared with strong monads,...
متن کاملClosed Freyd- and -categories
We give two classes of sound and complete models for the computational-calculus, or c-calculus. For the rst, we generalise the notion of cartesian closed category to that of closed Freyd-category. For the second, we generalise simple indexed categories. The former gives a direct semantics for the computational-calculus. The latter corresponds to an idealisation of stack-based intermediate langu...
متن کاملFreyd categories are Enriched Lawvere Theories
Lawvere theories provide a categorical formulation of the algebraic theories from universal algebra. Freyd categories are categorical models of first-order effectful programming languages. The notion of sound limit doctrine has been used to classify accessible categories. We provide a definition of Lawvere theory that is enriched in a closed category that is locally presentable with respect to ...
متن کاملCartesian differential categories
This paper revisits the authors’ notion of a differential category from a different perspective. A differential category is an additive symmetric monoidal category with a comonad (a “coalgebra modality”) and a differential combinator. The morphisms of a differential category should be thought of as the linear maps; the differentiable or smooth maps would then be morphisms of the coKleisli categ...
متن کاملDependent Cartesian Closed Categories
We present a generalization of cartesian closed categories (CCCs) for dependent types, called dependent cartesian closed categories (DCCCs), which also provides a reformulation of categories with families (CwFs), an abstract semantics for Martin-Löf type theory (MLTT) which is very close to the syntax. Thus, DCCCs accomplish mathematical elegance as well as a direct interpretation of the syntax...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2011
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2010.09.008